A Logical Approach to Abstract Algebra
نویسنده
چکیده
methods are used to prove elementary statements (typically analytical methods in number theory, like for Dirichlet’s theorem) These methods may use abstract existence statements, “ideal” objects, that may fail to exist effectively (typically, Hilbert’s proof of the basis theorem) Hilbert’s program: if one proves a concrete statement, one can always eliminate the use of these ideal objects, and obtain a purely elementary proof
منابع مشابه
A new branch of the logical algebra: UP-algebras
In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...
متن کاملAn Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries
Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partial algebraic characterisation of the supremum and of the infimum of abstract answers is given in an extended Relational Algebra of the Cylindric Algebra kind. Then, the form of queries is restricted in order to be able to compute answers without the cylindrification ope...
متن کاملAn Abstract Algebraic Logic View on Judgment Aggregation
In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg’s algebraic approach to characterization results in on judgment aggregation and propositionalattitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, res...
متن کاملInitial Algebra Semantics for Cyclic Sharing Tree Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and structural recursion. However, for graphs or ”tree-like” structures – trees involving cycles and sharing – it remains unclear what kind of inductive s...
متن کاملAlgebraic Logic view on Judgment Aggregation ?
In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg’s algebraic approach to characterization results on judgment aggregation and propositionalattitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2005